// Copyright (c) 2010, Google Inc.
// All rights reserved.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are
// met:
//
//     * Redistributions of source code must retain the above copyright
// notice, this list of conditions and the following disclaimer.
//     * Redistributions in binary form must reproduce the above
// copyright notice, this list of conditions and the following disclaimer
// in the documentation and/or other materials provided with the
// distribution.
//     * Neither the name of Google Inc. nor the names of its
// contributors may be used to endorse or promote products derived from
// this software without specific prior written permission.
//
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.

// ---
// Author: Jeffrey Junfeng Pan (panjunfeng@gmail.com)

#include "tree.h"
#include "common/strutil.h"
#include "common/testutil.h"

namespace {

class FrequentPatternTreeTest : public Test {
 protected:
  FrequentPatternTreeTest() {
  }

  virtual ~FrequentPatternTreeTest() {
  }
};

TEST_F(FrequentPatternTreeTest, MiningFrequentPatternItemsetTestCase0) {
  vector<vector<string> > transactions;
  transactions.resize(8);
  SplitStringUsing(" I like the shoes ", " ", &(transactions[0]));
  SplitStringUsing("the tshirts the", " ", &(transactions[1]));
  SplitStringUsing("the tshirts A", " ", &(transactions[2]));
  SplitStringUsing("the tshirts B shoes", " ", &(transactions[3]));
  SplitStringUsing("the pants", " ", &(transactions[4]));
  SplitStringUsing("tshirts the", " ", &(transactions[5]));
  SplitStringUsing("totally irrelevant", " ", &(transactions[6]));
  transactions[7].resize(0);

  frequent_pattern_mining::TransactionsMemoryImpl<string>
    transactions_obj(&transactions);

  frequent_pattern_mining::Tree<string>
    tree("THIS_ITEM_NEVER_EXISTS_IN_TRANSACTIONS");

  tree.BuildTree(&transactions_obj, 2, -1);
  cout << tree.TreeToString();
  cout << tree.HeaderToString();
  frequent_pattern_mining::Itemsets<string> results;
  tree.GetFrequentItemsets(2, -1, &results);
  cout << results.ToString();
}

TEST_F(FrequentPatternTreeTest, MiningFrequentPatternItemsetTestCase1) {
  vector<vector<string> > transactions;
  transactions.resize(5);
  SplitStringUsing("f a c d g i m p", " ", &(transactions[0]));
  SplitStringUsing("a b c f l m o", " ", &(transactions[1]));
  SplitStringUsing("b f h j o", " ", &(transactions[2]));
  SplitStringUsing("b c k s p", " ", &(transactions[3]));
  SplitStringUsing("a f c e l p m n", " ", &(transactions[4]));

  frequent_pattern_mining::TransactionsMemoryImpl<string>
    transactions_obj(&transactions);

  frequent_pattern_mining::Tree<string>
    tree("THIS_ITEM_NEVER_EXISTS_IN_TRANSACTIONS");

  tree.BuildTree(&transactions_obj, 2, -1);
  cout << tree.TreeToString();
  cout << tree.HeaderToString();
  frequent_pattern_mining::Itemsets<string> results;
  tree.GetFrequentItemsets(2, -1, &results);
  cout << results.ToString();
}

TEST_F(FrequentPatternTreeTest, MiningFrequentPatternItemsetTestCase2) {
  vector<vector<int> > transactions;
  transactions.resize(8);

  transactions[0].push_back(5);
  transactions[0].push_back(1);
  transactions[0].push_back(4);
  transactions[0].push_back(2);

  transactions[1].push_back(1);
  transactions[1].push_back(3);
  transactions[1].push_back(4);

  transactions[2].push_back(6);
  transactions[2].push_back(5);
  transactions[2].push_back(3);
  transactions[2].push_back(1);

  transactions[3].push_back(5);
  transactions[3].push_back(7);
  transactions[3].push_back(2);
  transactions[3].push_back(1);
  transactions[3].push_back(4);

  transactions[4].push_back(3);
  transactions[4].push_back(8);
  transactions[4].push_back(2);
  transactions[4].push_back(1);

  transactions[5].push_back(7);
  transactions[5].push_back(6);
  transactions[5].push_back(1);

  transactions[6].push_back(1);
  transactions[6].push_back(5);
  transactions[6].push_back(7);
  transactions[6].push_back(2);

  transactions[7].resize(0);

  frequent_pattern_mining::TransactionsMemoryImpl<int>
    transactions_obj(&transactions);

  frequent_pattern_mining::Tree<int> tree(-256);

  tree.BuildTree(&transactions_obj, 2, -1);
  cout << tree.TreeToString();
  cout << tree.HeaderToString();
  frequent_pattern_mining::Itemsets<int> results;
  tree.GetFrequentItemsets(2, -1, &results);
  cout << results.ToString();
}

}  // namespace

int main(int argc, char **argv) {
  return 0;
}
